On Optimality of d + 1 TI Shared Functions of 8 Bits or Less

We present a methodology for finding minimal number of output shares in $d + 1$ TI by modeling the sharing as set covering problem and using different discrete optimization techniques to find solutions. We demonstrate the results of our technique by providing optimal or near-optimal sharings of several classes of Boolean functions of any degree up to 8 variables, for first and second order TI. These solutions present new lower bounds for the total number of shares for these types of function

Optimized Threshold Implementations: Securing Cryptographic Accelerators for Low-Energy and Low-Latency Applications

Threshold implementations have emerged as one of the most popular masking countermeasures for hardware implementations of cryptographic primitives. In the original version of TI, the number of input shares was dependent on both security order $d$ and algebraic degree of a function $t$, namely $td + 1$. At CRYPTO 2015, a new method was presented yielding to a $d$-th order secure implementation using $d+1$ input shares. In this work, we first provide a construction for $d+1$ TI sharing which achieves the minimal number of output shares for any $n$-input Boolean function of degree $t=n-1$. Furthermore, we present a heuristic for minimizing the number of output shares for higher order $td + 1$ TI. Finally, we demonstrate the applicability of our results on $d+1$ and $td+1$ TI versions, for first- and second-order secure, low-latency and low-energy implementations of the PRINCE block cipher

A Note on 5-bit Quadratic Permutations’ Classification

Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees of their inverses, together with multiplicative complexity and existence of uniform threshold realizations

A Note on 5-bit Quadratic Permutations’ Classification

Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees of their inverses, together with multiplicative complexity and existence of uniform threshold realizations

New First-Order Secure AES Performance Records

Being based on a sound theoretical basis, masking schemes are commonly applied to protect cryptographic implementations against Side-Channel Analysis (SCA) attacks. Constructing SCA-protected AES, as the most widely deployed block cipher, has been naturally the focus of several research projects, with a direct application in industry. The majority of SCA-secure AES implementations introduced to the community opted for low area and latency overheads considering Application-Specific Integrated Circuit (ASIC) platforms. Albeit a few, those which particularly targeted Field Programmable Gate Arrays (FPGAs) as the implementation platform yield either a low throughput or a not-highly secure design.In this work, we fill this gap by introducing first-order glitch-extended probing secure masked AES implementations highly optimized for FPGAs, which support both encryption and decryption. Compared to the state of the art, our designs efficiently map the critical non-linear parts of the masked S-box into the built-in Block RAMs (BRAMs).The most performant variant of our constructions accomplishes five first-order secure AES encryptions/decryptions simultaneously in 50 clock cycles. Compared to the equivalent state-of-the-art designs, this leads to at least 70% reduction in utilization of FPGA resources (slices) at the cost of occupying BRAMs. Last but not least, we provide a wide range of such secure and efficient implementations supporting a large set of applications, ranging from low-area to high-throughput

Performance assessment of NOVA SDS011 low-cost PM sensor in various microenvironments

Over the last 10 years, as a possible alternative to the conventional approach to air quality monitoring, real-time monitoring systems that use low-cost sensors and sensor platforms have been frequently applied. Generally, the long-term characteristics of low-cost PM sensors and monitoring have not been thoroughly documented except for a few widely used sensors and monitors. This article addresses the laboratory and field validation of three low-cost PM monitors of the same type that use the NOVA SDS011 PM sensor module over a 1-year period. In outdoor environments, we co-located low-cost PM monitors with GRIMM EDM180 monitors at the National Air Quality Monitoring stations. In indoor environments, we co-located them with a Turnkey Osiris PM monitor. Several performance aspects of the PM monitors were examined: operational data coverage, linearity of response, accuracy, precision, and inter-sensor variability. The obtained results show that inter-monitor R values were typically higher than 0.95 regardless of the environment. The tested monitors demonstrate high linearity in comparison with PM10 and PM2.5 concentrations measured in outdoor air with reference-equivalent instrumentation with R2 values ranging from 0.52 up to 0.83. In addition, very good agreement (R2 values ranging from 0.93 up to 0.97) with the gravimetric PM10 and PM2.5 method is obtained in the indoor environment (30 < RH < 70%). High RH (over 70%) negatively affected the PM monitors’ response, especially in the case of PM10 concentrations (high overestimation)